Scheduling for overload in real-time systems
نویسندگان
چکیده
منابع مشابه
Scheduling for Overload in Real-Time Systems
Scheduling of real-time systems in overloaded conditions is a challenging problem. No on-line scheduling algorithm operating in an uniprocessor environment can guarantee to obtain a useful processor utilization greater than 0.25 under conditions of overload. The issue of improving overload performance in environments where there is a soft deadline has been addressed in this paper. The need of i...
متن کاملScheduling for Overload in Real-Time Systems
No on-line scheduling algorithm operating in an uniprocessor environment can guarantee to obtain a useful processor utilization greater than 0.25 under conditions of overload. This result holds in the general case, where the deadlines of the input tasks can be arbitrarily “tight.” We address here the issue of improving overload performance in environments where there is a limit on the tightness...
متن کاملHandling Overload Conditions in Real-Time Systems
This chapter deals with the problem of handling overload conditions, that is, those critical situations in which the computational demand requested by the application exceeds the processor capacity (Buttazzo, 2011). If not properly handled, an overload can cause an abrupt performance degradation, or even a system crash. Therefore, a real-time system should be designed to anticipate and tolerate...
متن کاملReal-time calculus for scheduling hard real-time systems
This paper establishes a link between three areas, namely Max-Plus Linear System Theory as used for dealing with certain classes of discrete event systems, Network Calculus for establishing time bounds in communication networks, and real-time scheduling. In particular, it is shown that important results from scheduling theory can be easily derived and unified using Max-Plus Algebra. Based on th...
متن کاملPerformance of algorithms for scheduling real-time systems with overrun and overload
This paper compares the performance of three classes of scheduling algorithms for real-time systems in which jobs may overrun their allocated processor time potentially causing the system to be overloaded. The first class, which contains classical priority scheduling algorithms as exemplified by DM and EDF, provides a baseline. The second class is the Overrun Server Method which interrupts the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 1997
ISSN: 0018-9340
DOI: 10.1109/12.620484